ID-based Threshold Blind Signature scheme from Bilinear Pairing

نویسندگان

  • Xiaohui Liang
  • Zhenfu Cao
  • ZhenChuan Chai
  • Rongxing Lu
چکیده

Threshold and Blindness are two important properties in cryptography system. They can provide security and privacy. In this paper, We present an efficient construction from Bilinear pairing in an ID-based cryptography system. In an ID-based (k, n) threshold blind signature scheme, Private Key Generation Center(PKGC) distributes the secret key to n group members. The user only communicates with the dealer who has collected no less than k valid sub-signatures and computes the group signature. During this process, the signer and the dealer have no information about the message(blindness). We analyze and prove the security of our scheme. To the best of the author’s knowledge, this is the first ID-based threshold blind signature scheme.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ID-Based Blind Signature and Ring Signature from Pairings

Recently the bilinear pairing such as Weil pairing or Tate pairing on elliptic curves and hyperelliptic curves have been found various applications in cryptography. Several identity-based (simply ID-based) cryptosystems using bilinear pairings of elliptic curves or hyperelliptic curves were presented. Blind signature and ring signature are very useful to provide the user’s anonymity and the sig...

متن کامل

One-Round ID-Based Blind Signature Scheme without ROS Assumption

In this paper, we propose a new ID-based blind signature scheme based on bilinear pairings from scratch (i.e. without using existing ID-based signature schemes, and without using existing computational assumptions). First, the round complexity of our ID-based blind signature scheme is optimal. Namely, each interactive signature generation requires the requesting user and the signer to transmit ...

متن کامل

An Identity-based Mediated Signature Scheme from Bilinear Pairing

It has always been a critical issue to find efficient methods for fast revocation of a user’s identity in identity (ID)based cryptosystems. Unfortunately, none of the previous ID-based cryptography can find a practical way. Libert et al. and Baek et al. respectively propose an ID-based mediated encryption scheme based on the practical ID-based encryption scheme from bilinear pairing due to Bone...

متن کامل

An Efficient ID - based Proxy Blind Signature with Pairing - free Realization

Proxy blind Signature allows an original signer to delegate his/her signing capability to a proxy signer who performs message signing blindly on behalf of original signer but he cannot make any link between the blind signature and the identity of the message's owner. Using bilinear pairings, so many ID-based proxy blind signature (IDPBS) schemes have been proposed. But the computation cost of a...

متن کامل

ID-Based Multi-Proxy Signature and Blind Multisignature from Bilinear Pairings

Multi-proxy signature allows the original signer delegate his singing power to a group of proxy signers. Blind proxy-signature allows the user to obtain a signature of a message from several signers in a way that each signer learns neither the message nor the resulting signature. Plenty of multi-proxy signature and blind multisignature schemes have been proposed under the certificate-based (CA-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006